package com.sfx.算法专题.前缀和;
import java.util.Scanner;
/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: sfx
 * Date: 2023-08-15
 * Time: 14:23
 */
public class Code_2_preFixSum2 {
    // 注意类名必须为 Main, 不要有任何 package xxx 信息
    public static class Main {
        public static void main(String[] args) {
            Scanner scan = new Scanner(System.in);
            // 输入n,m,q
            int n = scan.nextInt();//n行
            int m = scan.nextInt();//m列
            int q = scan.nextInt();//q次询问

            long[][] arr = new long[n][m];
            for(int i =0;i<n;++i) {
                for(int j =0;j<m;++j) {
                    arr[i][j] = scan.nextLong();
                }
            }
            // 得到预处理数组dp
            long[][] dp = new long[n+1][m+1];
            for(int i =1;i<=n;++i) {
                for(int j =1;j<=m;++j) {
                    dp[i][j] = dp[i-1][j] + dp[i][j-1] + arr[i-1][j-1] - dp[i-1][j-1];
                }
            }

            for(int i =0;i<q;++i) {
                int x1 = scan.nextInt();
                int y1 = scan.nextInt();
                int x2 = scan.nextInt();
                int y2 = scan.nextInt();
                long ans = dp[x2][y2] - dp[x1-1][y2] - dp[x2][y1-1] + dp[x1-1][y1-1];
                System.out.println(ans);
            }
        }
    }
}